Robust iterative closest point algorithm for registration of point sets with outliers
نویسندگان
چکیده
منابع مشابه
Registration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm Authors
This paper presents a novel approach for registering two sets of 3-D range data points, using an optimization algorithm that is both robust and efficient. The algorithm combines the speed of an iterative closest point algorithm with the robustness of a simulated annealing algorithm. Additionally, a robust error function is incorporated to deal with outliers.
متن کاملRegistration of Range Data Using a Hybrid Simulated Annealing and Iterative Closest Point Algorithm
The need to register data is abundant in applications such as: world modeling, part inspection and manufacturing, object recognition, pose estimation, robotic navigation, and reverse engineering. Registration occurs by aligning the regions that are common to multiple images. The largest difficulty in performing this registration is dealing with outliers and local minima while remaining efficien...
متن کاملRobust multisensor image registration with partial distance merits
Challenge in the registration of battlefield images in visible and far-infrared bands is the feature inconsistency. We use a contour-based approach and propose robust free-form curve-matching algorithms using the adaptive hill climbing and the iterative closest point algorithm. Both algorithms do not requires explicit curve feature correspondence, are designed to be robust against outliers. The...
متن کاملLieTrICP: An improvement of trimmed iterative closest point algorithm
We propose a robust registration method for two point sets using Lie group parametrization. Our algorithm is termed as LieTrICP, as it combines the advantages of the Trimmed Iterative Closest Point (TrICP) algorithm and Lie group representation. Given two low overlapped point sets, we first find the correspondence for every point, then select the overlapped point pairs, and use Lie group repres...
متن کاملPlane-Fitting Robust Registration for Complex 3D Models
In surgery planning, forensic and archeology, there is a need to perform analysis and synthesis of complex 3D models. One common first step of 3D model analysis and synthesis is to register a reference model to a target model using similarity transformation. In practice, the models usually contain noise and outliers, and are sometimes incomplete. These facts make the 3D similarity registration ...
متن کامل